A vector quantization method for nearest neighbor classifier design

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A vector quantization method for nearest neighbor classifier design

This paper proposes a nearest neighbor classifier design method based on vector quantization (VQ). By investigating the error distribution pattern of the training set, the VQ technique is applied to generate prototypes incrementally until the desired classification result is reached. Experimental results demonstrate the effectiveness of the method. 2004 Elsevier B.V. All rights reserved.

متن کامل

a lattice based nearest neighbor classifier for anomaly intrusion detection

as networking and communication technology becomes more widespread, thequantity and impact of system attackers have been increased rapidly. themethodology of intrusion detection (ids) is generally classified into two broadcategories according to the detection approaches: misuse detection and anomalydetection. in misuse detection approach, abnormal system behavior is defined atfirst, and then an...

متن کامل

Fast tree-structured nearest neighbor encoding for vector quantization

This work examines the nearest neighbor encoding problem with an unstructured codebook of arbitrary size and vector dimension. We propose a new tree-structured nearest neighbor encoding method that significantly reduces the complexity of the full-search method without any performance degradation in terms of distortion. Our method consists of efficient algorithms for constructing a binary tree f...

متن کامل

A fast nearest neighbor search algorithm based on vector quantization

In this article, we propose a new fast nearest neighbor search algorithm, based on vector quantization. Like many other branch and bound search algorithms [1, 10], a preprocessing recursively partitions the data set into disjointed subsets until the number of points in each part is small enough. In doing so, a search-tree data structure is built. This preliminary recursive data-set partition is...

متن کامل

A Bootstrap Technique for Nearest Neighbor Classifier Design

A bootstrap technique for nearest neighbor classifier design is proposed. Our primary interest in designing a classifier is in small training sample size situations. Conventional bootstrapping techniques sample the training samples with replacement. On the other hand, our technique generates bootstrap samples by locally combining original training samples. The nearest neighbor classifier is des...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pattern Recognition Letters

سال: 2004

ISSN: 0167-8655

DOI: 10.1016/j.patrec.2004.01.012